Characterization of reachable/nonreachable cellular automata statesDAS, Sukanta; SIKDAR, Biplab K; PAL CHAUDHURI, P et al.Lecture notes in computer science. 2004, pp 813-822, issn 0302-9743, isbn 3-540-23596-5, 10 p.Conference Paper

Infinity of intermediate states is decidable for Petri netsWIMMEL, Harro.Lecture notes in computer science. 2004, pp 426-434, issn 0302-9743, isbn 3-540-22236-7, 9 p.Conference Paper

BRAIN: Backward reachability analysis with integersRYBINA, Tatiana; VORONKOV, Andrei.Lecture notes in computer science. 2002, pp 489-494, issn 0302-9743, isbn 3-540-44144-1, 6 p.Conference Paper

Unification & sharing in timed automata verificationDAVID, Alexandre; BEHRMANN, Gerd; LARSEN, Kim G et al.Lecture notes in computer science. 2003, pp 225-229, issn 0302-9743, isbn 3-540-40117-2, 5 p.Conference Paper

A reachability algorithm for general petri nets based on transition invariantsKOSTIN, Alexander E.Lecture notes in computer science. 2006, pp 608-621, issn 0302-9743, isbn 3-540-37791-3, 1Vol, 14 p.Conference Paper

Unbounded Petri net synthesisDARONDEAU, Philippe.Lectures on concurrency and Petri nets : advances in Petri nets. Lecture notes in computer science. 2004, pp 413-438, issn 0302-9743, isbn 3-540-22261-8, 26 p.Book Chapter

On abstraction in software verificationCOUSOT, Patrick; COUSOT, Radhia.Lecture notes in computer science. 2002, pp 37-56, issn 0302-9743, isbn 3-540-43997-8, 20 p.Conference Paper

Modeling the reachable sets for positive linear systems using self-regulating adaptive perceptron type neural networksRUMCHEV, Ventsi G; SWINIARSKI, Roman W.Proceedings of the American Control Conference. 2002, pp 4642-4647, issn 0743-1619, isbn 0-7803-7298-0, 6Vol, 6 p.Conference Paper

Checking cleanness in linked listsDOR, N; RODEH, M; SAGIV, M et al.Lecture notes in computer science. 2000, pp 115-134, issn 0302-9743, isbn 3-540-67668-6Conference Paper

Modelling and analysing the SDL description of the ISDN-DSS1 protocolHUSBERG, N; TYNJÄLÄ, T; VARPAANIEMI, K et al.Lecture notes in computer science. 2000, pp 244-260, issn 0302-9743, isbn 3-540-67693-7Conference Paper

Beyond region graphs : Symbolic forward analysis of timed automataMUKHOPADHYAY, S; PODELSKI, A.Lecture notes in computer science. 1999, pp 232-244, issn 0302-9743, isbn 3-540-66836-5Conference Paper

Interprocedural path profilingMELSKI, D; REPS, T.Lecture notes in computer science. 1999, pp 47-62, issn 0302-9743, isbn 3-540-65717-7Conference Paper

Some observations on the computational complexity of graph accessibility problemTARUI, J; TODA, S.Lecture notes in computer science. 1999, pp 18-30, issn 0302-9743, isbn 3-540-66200-6Conference Paper

A logical reconstruction of reachabilityRYBINA, Tatiana; VORONKOV, Andrei.Lecture notes in computer science. 2003, pp 222-237, issn 0302-9743, isbn 3-540-20813-5, 16 p.Conference Paper

Abstracting WS1S systems to verify parameterized networksBAUKUS, K; BENSALEM, S; LAKHNECH, Y et al.Lecture notes in computer science. 2000, pp 188-203, issn 0302-9743, isbn 3-540-67282-6Conference Paper

Normed simulationsGRIFFIOEN, D; VAANDRAGER, F.Lecture notes in computer science. 1998, pp 332-344, issn 0302-9743, isbn 3-540-64608-6Conference Paper

Reset nets between decidability and undecidabilityDUFOURD, C; FINKEL, A; SCHNOEBELEN, P et al.Lecture notes in computer science. 1998, pp 103-115, issn 0302-9743, isbn 3-540-64781-3Conference Paper

Controlled reachability analysis in AI planning : Theory and practiceZEMALI, Yacine.Lecture notes in computer science. 2005, pp 264-278, issn 0302-9743, isbn 3-540-28761-2, 15 p.Conference Paper

AsmL Specification and Verification of Lamport's Bakery AlgorithmBOTINCAN, Matko.Information technology interfaces. 2005, pp 617-623, isbn 953-7138-02-X, 1Vol, 7 p.Conference Paper

Reachability analysis in T-invariant-less Petri netsKOSTIN, Alexander E.IEEE transactions on automatic control. 2003, Vol 48, Num 6, pp 1019-1024, issn 0018-9286, 6 p.Article

On one-pass term rewritingFÜLÖP, Z; JURVANEN, E; STEINBY, M et al.Lecture notes in computer science. 1998, pp 248-256, issn 0302-9743, isbn 3-540-64827-5Conference Paper

A point-based POMDP algorithm for robot planningSPAAN, Matthijs T. J; VLASSIS, Nikos.IEEE International Conference on Robotics and Automation. 2004, pp 2399-2404, isbn 0-7803-8232-3, 5Vol, 6 p.Conference Paper

Abstract interpretation of game propertiesHENZINGER, T. A; MAJUMDAR, R; RASKIN, J.-F et al.Lecture notes in computer science. 2000, pp 220-239, issn 0302-9743, isbn 3-540-67668-6Conference Paper

A decidable logic for describing linked data structuresBENEDIKT, M; REPS, T; SAGIV, M et al.Lecture notes in computer science. 1999, pp 2-19, issn 0302-9743, isbn 3-540-65699-5Conference Paper

Page / 25